Labelled modal tableaux

نویسنده

  • Guido Governatori
چکیده

Labelled tableaux are extensions of semantic tableaux with annotations (labels, indices) whose main function is to enrich the modal object language with semantic elements. This paper consists of three parts. In the first part we consider some options for labels: simple constant labels vs labels with free variables, logic depended inference rules vs labels manipulation based on a label algebra. In the second and third part we concentrate on a particular labelled tableaux system called KEM using free variable and a specialised label algebra. Specifically in the second part we show how labelled tableaux (KEM) can account for different types of logics (e.g., non-normal modal logics and conditional logics). In the third and final part we investigate the relative complexity of labelled tableaux systems and we show that the uses of KEM’s label algebra can lead to speed up on proofs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Relative Complexity of Labelled Modal Tableaux

The relative computational complexity of two free-variable labelled modal tableaux (KEM and Single Step Tableaux, SST) is investigated. We discuss the reasons why p-simulation is not a proper measure to compare tableaux-like proof systems, and we propose an improved comparison scale (p-search-simulation). It shown that KEM p-search-simulates SST while SST cannot p-search-simulate KEM.

متن کامل

Labelled Tableaux for Non-normal Modal Logics

In this paper we show how to extend KEM, a tableau-like proof system for normal modal logic, in order to deal with classes of non-normal modal logics, such as monotonic and regular, in a uniform and modular way.

متن کامل

Free Variable Tableaux for Propositional Modal Logics Universit at Karlsruhe Fakult at F Ur Informatik Free Variable Tableaux for Propositional Modal Logics

We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain \free" and \universal" variables. Our \lean" Prolog implementation is not only surprisingly short, but compares favourably with other considerably more complex implementations for modal deduction.

متن کامل

Labelled Tableaux for Multi-Modal Logics

In this paper we present a tableau-like proof system for multi-modal logics based on D’Agostino and Mondadori’s classical refutation system KE [DM94]. The proposed system, that we call KEM , works for the logics S5A and S5P(n) which have been devised by Mayer and van der Hoek [MvH92] for formalizing the notions of actuality and preference. We shall also show howKEM works with the normal modal l...

متن کامل

A tableux system for Deontic Interpreted Systems

We develop a labelled tableaux system for the modal logic KD45 j n extended with epistemic notions. This logic characterises a particular type of interpreted systems used to represent and reason about states of correct and incorrect functioning behaviour of the agents in a system, and of the system as a whole. The resulting tableaux system provides a simple decision procedure for the logic. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008